691A - Fashion in Berland - CodeForces Solution


implementation *1000

Please click on ads to support us..

Python Code:

n=int(input())
a=input()
print('NYOE S'[(n<2 and a.count('1')) or (n>1 and a.count('0')==1)::2])

C++ Code:

#include <bits/stdc++.h>
using namespace std;
# define ll long long int
#define cn cout<<"NO"<<endl
#define cy cout<<"YES"<<endl
#define pb push_back

int main() {
    ll n;
    cin>>n;
    ll ct0=0;
    for(int i=0;i<n;i++) {
      ll x;
      cin>>x;
      if(x==0){
        ct0++;
      }
    }
    if(n==1&&ct0==0){
      cy;
    }
    else if(n>1&&ct0==1){
      cy;
    }
    else {
      cn;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1622B - Berland Music
1139B - Chocolates
1371A - Magical Sticks
1253A - Single Push
706B - Interesting drink
1265A - Beautiful String
214A - System of Equations
287A - IQ Test
1108A - Two distinct points
1064A - Make a triangle
1245C - Constanze's Machine
1005A - Tanya and Stairways
1663F - In Every Generation
1108B - Divisors of Two Integers
1175A - From Hero to Zero
1141A - Game 23
1401B - Ternary Sequence
598A - Tricky Sum
519A - A and B and Chess
725B - Food on the Plane
154B - Colliders
127B - Canvas Frames
107B - Basketball Team
245A - System Administrator
698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem